Back to course home
0% completed
Vote For New Content
Introduction
Course Overview
Basics of Tree
Introduction to Tree
Types of Tree
BST Traversal Techniques
BST Operations
Level Order Traversal Pattern (easy)
Introduction to Level Order Traversal Pattern
Reverse Level Order Traversal (easy)
Solution: Reverse Level Order Traversal
Find Largest Value in Each Tree Row (medium)
Solution: Find Largest Value in Each Tree Row
Maximum Width of Binary Tree (medium)
Solution: Maximum Width of Binary Tree
Maximum Level Sum of a Binary Tree (medium)
Solution: Maximum Level Sum of a Binary Tree
Zigzag Traversal (medium)
Solution: Zigzag Traversal
Even Odd Tree (medium)
Solution: Even Odd Tree
N-ary Tree Level Order Traversal (hard)
Solution: N-ary Tree Level Order Traversal
Tree Depth Pattern (easy)
Introduction to Tree Depth Pattern
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Minimum Depth of a Binary Tree (easy)
Solution: Minimum Depth of a Binary Tree
Balanced Binary Tree (easy)
Solution: Balanced Binary Tree
Tree Diameter (easy)
Solution: Tree Diameter
Maximum Depth of N-ary Tree (easy)
Solution: Maximum Depth of N-ary Tree
Find maximum depth of subtree (medium)
Solution: Find maximum depth of subtree
Serialize and Deserialize Tree Pattern (hard)
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Mirror Image Trees (medium)
Problem Statement
Given two binary trees root and root2, return true if they are mirror images of each other. Otherwise, return false.
Two trees are said to be mirror images if, for every node in one tree, there is a corresponding node in the other tree with a mirrored structure. This means the left subtree of one tree is a mirror reflection of the right subtree of the other tree, and vice versa.
Examples
Example 1
- Input: root1 = [1,2,3,4,null,null,5], root2 = [1,3,2,5,null,null,4]
- Expected Output:
true - Justification: Both trees have the same root, and the left and right subtrees are mirrors of each other.
Example 2
- Input: root1 = [4, 5, 6, null, 7], root2 = [4, 6, 5, null, null, 7]
- Expected Output:
true - Justification: Both trees are a mirror of each other.
Example 3
- Input: root1 = [1, 2, null, 3], root2 = [1, null, 2]
- Expected Output:
false - Justification: The structure of the subtrees differs. The first tree contains node
3but the second tree doesn't.
Try it yourself
Try solving this question here:
Java
. . . .
Solution: Symmetric Tree
Solution: Mirror Image Trees
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself